EXTREMAL PRINCIPLES FOR SIMULATING TRAFFIC FLOW IN A NETWORK
نویسندگان
چکیده
منابع مشابه
Behavioral Analysis of Traffic Flow for an Effective Network Traffic Identification
Fast and accurate network traffic identification is becoming essential for network management, high quality of service control and early detection of network traffic abnormalities. Techniques based on statistical features of packet flows have recently become popular for network classification due to the limitations of traditional port and payload based methods. In this paper, we propose a metho...
متن کاملSimulating Interdomain Traffic at the Flow-Level
This paper presents a model for interdomain traffic simulation at the flow level. The model explicitly takes into account three network-related variables for the traffic generation process: the arrival process of the layer-4 flows, the traffic volume carried over these flows and the rate at which these flows can send traffic. The variables of the model are first analyzed on a real flow-level in...
متن کاملOn Search for all d-MCs in a Network Flow
A number of problems in several areas such as power transmission and distribution, communication and transportation can be formulated as a stochastic-flow network (SFN). The system reliability of an SFN can be computed in terms of all the upper boundary points, called d-MinCuts (d-MCs). Several algorithms have been proposed to find all the d-MCs in an SFN. Here, some recent studies in the liter...
متن کاملA neuro-fuzzy approach to vehicular traffic flow prediction for a metropolis in a developing country
Short-term prediction of traffic flow is central to alleviating congestion and controlling the negative impacts of environmental pollution resulting from vehicle emissions on both inter- and intra-urban highways. The strong need to monitor and control congestion time and costs for metropolis in developing countries has therefore motivated the current study. This paper establishes the applicatio...
متن کاملAsymptotic Traffic Flow in a Hyperbolic Network: Non-uniform Traffic
In this work we study the asymptotic traffic flow in Gromov’s hyperbolic graphs when the traffic decays exponentially with the distance. We prove that under general conditions, there exists a phase transition between local and global traffic. More specifically, assume that the traffic rate between two nodes u and v is given by R(u, v) = β−d(u,v) where d(u, v) is the distance between the nodes. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the National Academy of Sciences
سال: 1958
ISSN: 0027-8424,1091-6490
DOI: 10.1073/pnas.44.2.201